An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

大规模代谢网络分解的生物信息学研究

随着大规模分子相互作用数据的不断涌现,生物学网络方面的研究正日益得到重视.代谢网络处于生物体的功能执行阶段,其结构组成方式不仅反映了生物体的功能构成,也直接影响代谢工程中的途径分析和研究.作为代谢网络研究的重要环节,实现网络的合理分解不仅对于基因组范围内分子网络的结构和功能研究具有重要意义,也是代谢工程的途径分析和优化得以顺利进行的前提之一.在回顾代谢网络宏观结构和拓扑特征研究成果的基础上,通过对现有分解方法的深入分析,指出缺乏合理且有针对性的模型评估准则是目前网络分解研究中亟待解决的问题之一.今后的研究趋势在于如何整合更多的信息和发展更先进的分析方法,建立更合理的模型,并进一步拓展网络分解的应用范围.     

流域变换的串行与并行策略研究

流域变换是数字形态学中用于图像分割的一种经典方法,其并行化问题成为近年来研究的重点。首先给出了流域变换的数学模型,并归纳列举了几种离散情况下的形式化定义;其次分类总结了近年来流域变换串行算法研究的新进展,从而在此基础上重点讨论了相应的并行化策略。详细分析了设计并行流域算法需要考虑的几个问题;并比较评价了现有并行算法的性能特点,得出了一些结论;最后提出了有待进一步研究的问题。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

子空间投影后波束形成的导航接收机抗干扰性能分析

利用导航信号淹没于干扰信号和热噪声的特点,将天线阵列接收的空时信号矢量向干扰子空间的正交子空间投影以实现干扰抑制。当接收机对投影后的单阵元数据捕获成功后,利用捕获估计的本地扩频码相位作为参考信号,依据最小均方误差准则进行波束形成。仿真结果表明该抗干扰算法在零陷强干扰的同时使主波束指向导航信号来波方向,有效提高了阵列输出信干噪比,并降低了空时自适应处理对导航信号伪码相关峰形状和载波跟踪性能的影响。     

Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

军队干部交流分配模型研究

针对军队干部交流分配常常采用定性方法的现状,结合每年都要交流大量干部的实际情况,在可行、合理交流的基础上,综合利用Delphi法、系统分解与协调法建立了干部交流分配模型,从而实现了干部在各种类别之间的交流,为军队干部的交流分配提供了定量依据.     

经验模态分析法在雷达信号脉内分析中的应用

雷达脉内特征分析是信号分选领域一个重要手段,当脉内信号有多个雷达信号交叠在一起时,很难分析出其各自的调制方式。经验模态分解(EMD)在分析非平稳混合信号时效果显著,但其存在2个明显弊端。针对端点效应问题,首先采用小波分解将信号分解成各分量,随后对除噪声外的各分量利用ARMA模型对信号进行预测,接着对预测后的各分量进行小波重构,从而消除了端点效应,针对虚假分量的问题,结合雷达信号的特点改进了其终止条件,提高了EMD分解的性能。最后,对EMD分解后的各分量进行时频分析,得出雷达脉内信号的调制特征。仿真验证了算法的有效性。     

THE DEFENCE SPENDING–EXTERNAL DEBT NEXUS IN ETHIOPIA

The aim of this paper is to examine the impact of defence spending and income on the evolution of Ethiopia’s external debt over the period 1970–2005. Using the bounds test approach to cointegration and Granger causality tests, we find a long run and a causal relationship between external debt, defence spending and income. Defence spending had a positive and a significant impact on the stock of external debt while income had a negative and a statistically significant impact on external debt. Our findings suggest that an increase in defence spending contributes to the accumulation of Ethiopia’s external debt, while an increase in economic growth helps Ethiopia to reduce its external debt.